The chromatic difference sequence of a graph
نویسندگان
چکیده
منابع مشابه
Graph products and the chromatic difference sequence of vertex-transitive graphs
We give examples of vertex-transitive graphs with non-monotonic chromatic difference sequences, disproving a conjecture of Albertson and Collins on the monotonicity of the chromatic difference sequence of vertex-transitive graphs, and answering a question of Zhou on the achievability of circulants.
متن کاملThe chromatic difference sequence of the Cartesian product of graphs
Zhou, H., The chromatic difference sequence of the Cartesian product of graphs: Part II, Discrete Applied Mathematics 41 (1993) 263-267. This paper is a continuation of our earlier paper under the same title. We prove that the normalized chromatic difference sequences of the Cartesian powers of a Cayley graph on a finite Abelian group are stable; and that if the chromatic difference sequence of...
متن کاملtotal dominator chromatic number of a graph
given a graph $g$, the total dominator coloring problem seeks aproper coloring of $g$ with the additional property that everyvertex in the graph is adjacent to all vertices of a color class. weseek to minimize the number of color classes. we initiate to studythis problem on several classes of graphs, as well as findinggeneral bounds and characterizations. we also compare the totaldominator chro...
متن کاملthe order difference interval graph of a group
in this paper we introduce the concept of order difference interval graph $gamma_{odi}(g)$ of a group $g$. it is a graph $gamma_{odi}(g)$ with $v(gamma_{odi}(g)) = g$ and two vertices $a$ and $b$ are adjacent in $gamma_{odi}(g)$ if and only if $o(b)-o(a) in [o(a), o(b)]$. without loss of generality, we assume that $o(a) leq o(b)$. in this paper we obtain several properties of $gamma_...
متن کاملThe set chromatic number of a graph
For a nontrivial connected graph G, let c : V (G) → N be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) 6= NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is calle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1980
ISSN: 0095-8956
DOI: 10.1016/0095-8956(80)90040-4